|
C
Cardelli, 11, 487
Cartesian product, 55, 67, 127, 206, 356
cases rule, 428, 429, 437, 442, 448
characterise, 3, 6
choice point, 129, 130, 131, 182
chronological backtracking, 228
Church, 2, 3, 5, 6, 7, 8, 9, 156, 160, 161, 162, 487
Church-Rosser, vi, 160
Clarke, 494
class, 5, 6, 11, 70, 129, 131
clause, 159, 226, 346, 349, 352, 353, 355, 357, 360, 361, 362, 363, 364, 365, 366, 374, 375, 376, 377, 378, 379, 381, 382, 383, 385, 387, 388, 389, 396, 397, 399, 400, 403, 405, 406, 408, 449, 451, 452, 477
Clojure, 13, 34
closed lambda expression, 157
closure, 71, 72, 320, 321
code point, 62, 64, 68
Colmeraur, 345
combinator, 157, 168, 416, 418, 427, 437, 443, 448, 449
combinator rule, 427, 429, 437, 443
combinatorial explosion, 130, 204
comment, 29, 174, 479
committed choice, 443
Common Lisp, 10, 14, 16, 17, 52, 100, 109, 333, 336, 478, 479, 482
compile, 9, 10, 11, 12, 25, 32, 112, 131, 144, 145, 152, 178, 214, 345, 448, 482
compiler-compiler, 15, 142, 481
complement, 458
complete, 22, 138, 227, 228, 229, 349, 368, 424, 428
computable, 1, 6, 8, 143, 216, 268, 315, 388
conclusion, 98, 215, 216, 219, 228, 229, 238, 252, 261, 369, 424, 450
concrete syntax, 274
concurrency, 84
conditional equations, 27
conditional rule, 427
conjunction, 152, 153, 217, 218, 226, 240, 306, 307, 308, 346, 352
cons cell, 8, 60, 86
cons form, 51, 54, 86, 174, 179, 183, 251, 336, 385, 444
cons rule, 426
consing, 50, 51
constraint programming, 141, 368
constraint satisfaction problem, 141
constraints, 141, 167, 368, 375, 377, 380, 448
constructive existence proof, 252
context-free, 133, 475
continuation, 125, 383, 384
control, 23, 43, 88, 109, 123, 151, 162, 196, 226, 250, 255, 272, 320, 321, 360, 388, 392, 397, 400, 403, 411, 438, 451, 456
convergence, 75
correctness condition, 444, 445
currying, 71, 72, 168, 204
cut, 119, 220, 254, 255, 265, 312, 346, 360, 361, 362, 368, 372, 374, 375, 379, 383, 399, 400, 401, 402, 403, 421, 456
cut rule, 220
|
|
